The Distribution of the Combined Length of Spanned Cycles in a Random Permutation
نویسندگان
چکیده
For a random permutation π on {1, 2, . . . , n} for fixed n, and forM ⊆ {1, 2, . . . , n}, we analyse the distribution of the combined length L = L(π,M) of all cycles of π that contain at least one element of M . We give a simple, explicit formula for the probability of every possible value for L (backed by three proofs of distinct flavours), as well as closed-form formulae for its expectation and variance, showing that less than 1 |M |+1 of the elements 1, . . . , n are expected to be contained in cycles of π that are disjoint from M , with low probability for a large deviation from this fraction. We furthermore give a simple explicit formula for all rising-factorial moments of L. These results are applicable to the study of manipulation in matching markets. Given a random permutation on a fixed finite set of objects, we are interested in the combined length of all cycles of the permutation that intersect a given subset of these objects (or alternatively, of all cycles of the permutation that are disjoint from this given subset); when the subset consists of a single point, this quantity is simply the wellstudied length of the cycle that contains that point (for an analysis of this special case, see e.g. [1, p. 24]). The question of the distribution of this quantity arises during analysis of the limits of manipulation in matching markets; for more information, the interested reader is referred to [2]. We commence by precisely defining the problem at hand. Definition 1. Throughout this paper, we use the following standard notation. • P , {1, 2, 3, . . .} [5]; throughout this paper, k, `, ̃̀,m, m̃, n, ñ denote elements of P. • [n] , {1, 2, . . . , n} [5]. • [m,n] , {m,m+ 1, . . . , n} [5] . ([m,n] = ∅ if m > n.) • SN , {π : N 7→ N | π is a bijection} — the set of permutations of a set N . • Sn , S[n]. • Furthermore, we denote n , n · (n+ 1) · . . . · (n+ k − 1) = (n+k−1)! (n−1)! . ∗Einstein Institute of Mathematics and Center for the Study of Rationality, Hebrew University of Jerusalem, Israel. Email : [email protected].
منابع مشابه
Measuring Post–Quickselect Disorder
This paper deals with the amount of disorder that is left in a permutation after one of its elements has been selected with quickselect with or without median-of-three pivoting. Five measures of disorder are considered: inversions, cycles of length less than or equal to some m, cycles of any length, expected cycle length, and the distance to the identity permutation. “Grand averages” for each m...
متن کاملCycles of Random Permutations with Restricted Cycle Lengths
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in a forthcoming paper [BG], where we prove results about cycles of random permutations which can be written as free words in several independent random permut...
متن کاملCyclation.tex Random Cyclations
Consider n unit intervals, say [1, 2], [3, 4],. .. , [2n − 1, 2n]. Identify their end-points in pairs at random, with all (2n − 1)!! = (2n − 1)(2n − 3) · · · 3 · 1 pairings being equally likely. The result is a collection of cycles of various lengths, and we investigate the distribution of these lengths. The distribution is similar to that of the distribution of the lengths of cycles in a rando...
متن کاملOptimal Batch Production for a Single Machine System with Accumulated Defectives and Random Rate of Rework
In this paper we consider an imperfect production system which produces good and defective items and assume that defective items can be reworked. Due to the nature of rework process we do not restrict the rework rate to be equal to normal production rate or constant and assume that it is a random variable with an arbitrary distribution function. We also assume as it is true in most real world s...
متن کاملCycles of Free Words in Several Independent Random Permutations
In this text, extending results of [Ni94] and [Ne05], we study the asymptotics of the number of cycles of a given length of a word in several independent random permutations with restricted cycle lengths. Specifically, for A1,. . . , Ak non empty sets of positive integers and for w word in the letters g1, g −1 1 , . . . , gk, g −1 k , we consider, for all n such that it is possible, an independ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013